Cauchy Problem of Some Doubly Degenerate Parabolic Equations with Initial Datum a Measure

This paper discusses the Cauchy problem of the equation

An Arc as the Inverse Limit of a Single Bonding Map of Type N on [0,1]

Let I = [0, 1], c ₁, c ₂ ∈ (0, 1) with c ₁ < c ₂ and f : I⊸I be a continuous map satisfying: are both strictly increasing and is strictly decreasing. Let A = {x ∈ [0, c ₁]∣f(x) = x}, a=max A, a ₁ =max(A\{a}), and B = {x ∈ [c ₂, 1]∣f(x) = x}, b=minB, b ₁ =min(B\{b}). Then the inverse limit (I, f) is an arc if and only if one of the following three conditions holds: (1) If c ₁ < f (c ₁) ≤ c ₂ (resp. c ₁ ≤ f (c ₂) < c ₂), then f has a single fixed point, a period two orbit, but no points of period greater than two or f has more than one fixed point but no points of other periods, furthermore, if A≠φ and B≠φ, then f (c ₂) > a (resp. f (c ₁) < b). (2) If f (c ₁) ≤ c ₁ (resp. f (c ₂) ≥ c ₂), then f has more than one fixed point, furthermore, if B≠φ and A\ {a} ≠φ, f (c ₂) ≥ a or if a ₁ < f (c ₂) < a, f ² (c ₂) > f (c ₂), (resp. f has more than one fixed point, furthermore, if A≠φ and B\{b}≠φ, f (c ₁) ≤ b or if b < f (c ₂) < b ₁, f ² (c ₁) < f (c ₁)). (3) If f (c ₁) > c ₂ and f (c ₂) < c ₁, then f has a single fixed point, a single period two orbit lying in I\(u, v) but no points of period greater than two, where u, v ∈ [c ₁, c ₂] such that f (u) = c ₂ and f (v) = c ₁. Supported by the National Natural Science Foundation of China (No. 19961001, No. 60334020) and Outstanding Young Scientist Research Fund. (No. 60125310)     

Existence of Entire Solutions of a Singular Semilinear Elliptic Problem

In this paper, we obtain some existence results for a class of singular semilinear elliptic problems where we improve some earlier results of Zhijun Zhang. We show the existence of entire positive solutions without the monotonic condition imposed in Zhang‘s paper. The main point of our technique is to choose an approximating sequence and prove its convergence. The desired compactness can be obtained by the Sobolev embedding theorems.     

The Attribute Based Hill Climber

In this paper we introduce the Attribute Based Hill Climber, a parameter-free algorithm that provides a concrete, stand-alone implementation of a little used technique from the Tabu Search literature known as regional aspiration. Results of applying the algorithm to two classical optimisation problems, the Travelling Salesman Problem and the Quadratic Assignment Problem, show it to be competitive with existing general purpose heuristics in these areas.     

Selecting distances in arrangements of hyperplanes spanned by points

In this paper we consider a problem of distance selection in the arrangement of hyperplanes induced by n given points. Given a set of n points in d-dimensional space and a number k, , determine the hyperplane that is spanned by d points and at distance ranked by k from the origin. For the planar case we present an O(nlog²n) runtime algorithm using parametric search partly different from the usual approach [N. Megiddo, J. ACM 30 (1983) 852]. We establish a connection between this problem in 3-d and the well-known 3SUM problem using an auxiliary problem of counting the number of vertices in the arrangement of n planes that lie between two sheets of a hyperboloid. We show that the 3-d problem is almost 3SUM-hard and solve it by an O(n²log²n) runtime algorithm. We generalize these results to the d-dimensional (d4) space and consider also a problem of enumerating distances.     

The propionyl cation heat of formation revisited

The 298 K heat of formation for the propionyl cation (C₂H₅CO⁺) has been measured previously by dissociative photoionization mass spectrometry. However, recent theoretical and experimental studies involving methylketene suggest that this may be significantly underestimated, resulting in a methylketene proton affinity that is too high by ∼30 kJ mol⁻¹. In this study, the previous m/z 57 appearance energies were carefully re-evaluated, with various possible sources of error being investigated. These include factors such as sample purity, carbon-13 contamination from lower energy m/z 56 processes, kinetic and/or competitive shifts, reverse activation energies, ionizing energy calibration errors and the availability of accurate supplementary thermochemical data. In addition, high-level ab initio calculations are used to model the relevant unimolecular fragmentation processes for each of the ionized precursor molecules. As a result, it is found that only the 2-butanone appearance energy can be used to provide a reliable value for the propionyl cation heat of formation. From the 298 K m/z 57 appearance energy of 10.199 ± 0.003 eV for 2-butanone measured here, a value of 617.8 ± 0.9 kJ mol⁻¹ is derived for , which corresponds to 845.4 ± 4.8 kJ mol⁻¹ for the proton affinity of methylketene. This is in good agreement with previous theoretical calculations and thermokinetic proton affinity measurements, indicating that a significant upward revision to the propionyl cation heat of formation is warranted. Copyright © 2004 John Wiley & Sons, Ltd.     

An Inverse Problem for an Harmonic Oscillator Perturbed by Potential: Uniqueness

Consider the perturbed harmonic oscillator Ty = -y" + x²y + q(x)y on L²(R) where the real potential q satisfy some assumption on infinity (the case q L²(R), (t+1)^-rdt), r < 1 is covered).     

The Dial-a-Ride Problem (DARP): Variants,modeling issues and algorithms

The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pick-up and drop-off requests between origins and destinations. The aim is to plan a set of m minimum cost vehicle routes capable of accommodating as many users as possible, under a set of constraints. The most common example arises in door-to-door transportation for elderly or disabled people. The purpose of this article is to review the scientific literature on the DARP. The main features of the problem are described and classified and some modeling issues are discussed. A summary of the most important algorithms is provided.AMS classification: 90B06, 90C27, 90C59     

Primal separation algorithms

Given an integer polyhedron , an integer point , and a point , the primal separation problem is the problem of finding a linear inequality which is valid for P _I , violated by x ^*, and satisfied at equality by . The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for several well-known classes of inequalities for various important combinatorial optimization problems, including the knapsack, stable set and travelling salesman problems.Received: November 2002, Revised: March 2003,